New Modular Symmetric Function and its Applications: Modular s-Stirling Numbers
نویسندگان
چکیده
In this paper, we consider generalizations of the Stirling number first and second kind by using a specialization new family symmetric functions. We give combinatorial interpretations for these functions means weighted lattice path tilings. also present some convolutions involving complete elementary Additionally, introduce different families set partitions to modular s-Stirling numbers.
منابع مشابه
Fixed point theorem for non-self mappings and its applications in the modular space
In this paper, based on [A. Razani, V. Rako$check{c}$evi$acute{c}$ and Z. Goodarzi, Nonself mappings in modular spaces and common fixed point theorems, Cent. Eur. J. Math. 2 (2010) 357-366.] a fixed point theorem for non-self contraction mapping $T$ in the modular space $X_rho$ is presented. Moreover, we study a new version of Krasnoseleskii's fixed point theorem for $S+T$, where $T$ is a cont...
متن کاملNew modular properties of bell numbers
The Bell number B, is the number of partitions of a finite set whose cardinality is n. The modular properties of Bell numbers have been studied by many authors. It is well known that the sequence of the residues of Bell numbers modulo any integer satisfies a linear recurrence and is periodic [ 1, 68, 13, 143. When the modulus is prime, this recurrence is particularly simple. Touchard [16] shows...
متن کاملSymmetric Modular Diophantine Inequalities
In this paper we study and characterize those Diophantine inequalities axmod b ≤ x whose set of solutions is a symmetric numerical semigroup. Given two integers a and b with b = 0 we write a mod b to denote the remainder of the division of a by b. Following the notation used in [8], a modular Diophantine inequality is an expression of the form ax mod b ≤ x. The set S(a, b) of integer solutions ...
متن کاملModular Schur Numbers
For any positive integers l and m, a set of integers is said to be (weakly) l-sumfree modulo m if it contains no (pairwise distinct) elements x1, x2, . . . , xl, y satisfying the congruence x1 + . . .+ xl ≡ y mod m. It is proved that, for any positive integers k and l, there exists a largest integer n for which the set of the first n positive integers {1, 2, . . . , n} admits a partition into k...
متن کاملA New Modular Division Algorithm and Applications
The present paper proposes a new parallel algorithm for the modular division u/v mod βs, where u, v, β and s are positive integers (β ≥ 2). The algorithm combines the classical add-and-shift multiplication scheme with a new propagation carry technique. This “Pen and Paper Inverse” (PPI) algorithm, is better suited for systolic parallelization in a “least-significant digit first” pipelined manne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society
سال: 2022
ISSN: ['2180-4206', '0126-6705']
DOI: https://doi.org/10.1007/s40840-022-01262-8